# practical computability

- 实用可计算性

*English-Chinese computer dictionary (英汉计算机词汇大词典).
2013.*

### Look at other dictionaries:

**Turing machine**— For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia**Decision problem**— A decision problem has only two possible outputs, yes or no (or alternately 1 or 0) on any input. In computability theory and computational complexity theory, a decision problem is a question in some formal system with a yes or no answer,… … Wikipedia**Computer science**— or computing science (abbreviated CS) is the study of the theoretical foundations of information and computation and of practical techniques for their implementation and application in computer systems. Computer scientists invent algorithmic… … Wikipedia**automata theory**— Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium**Algorithm**— Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia**Register machine**— In mathematical logic and theoretical computer science a register machine is a generic class of abstract machines used in a manner similar to a Turing machine. All the models are Turing equivalent. Contents 1 Overview 2 Formal definition 3 … Wikipedia**Finite state machine**— A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… … Wikipedia**Busy beaver**— In computability theory, a busy beaver (from the colloquial expression for an industrious person) is a Turing machine that attains the maximum operational busyness (such as measured by the number of steps performed, or the number of nonblank… … Wikipedia**Simulated reality**— is the proposition that reality could be simulated perhaps by computer simulation to a degree indistinguishable from true reality. It could contain conscious minds which may or may not be fully aware that they are living inside a simulation. This … Wikipedia**Computational complexity theory**— is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia**Finite-state machine**— State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia